ML with PTIME complexity guarantees
نویسندگان
چکیده
Implicit Computational Complexity is a line of research where the possibility to inference a valid property for a program implies that the program runs in particular complexity class. Soft type systems are one of the research threads within the field. We present here a soft type system with ML-like polymorphism that enjoys decidable typechecking, type inference and typability problems and gives polynomial time computational guarantees for the running time of typed programs. 1998 ACM Subject Classification F.3.3 Studies of program constructs, F.4.1 Mathematical logic
منابع مشابه
Linear lambda calculus and PTIME-completeness
We give transparent proofs of the PTIME-completeness of two decision problems for terms in the λ-calculus. The first is a reproof of the theorem that type inference for the simplytyped λ-calculus is PTIME-complete. Our proof is interesting because it uses no more than the standard combinators Church knew of some 70 years ago, in which the terms are linear affine—each bound variable occurs at mo...
متن کاملAn Analysis of the Core-ML Language: Expressive Power and Type Reconstruction
Core-ML is a basic subset of most functional programming languages. It consists of the simply typed (or monomorphic)-calculus, simply typed equality over atomic constants, and let as the only poly-morphic construct. We present a synthesis of recent results which characterize this \toy" language's expressive power as well as its type reconstruction (or type inference) problem. More speciically: ...
متن کاملBisimulation-invariant PTIME and higher-dimensional µ-calculus
Consider the class of all those properties of worlds in nite Kripke structures (or of states in inite transition systems), that are recognizable in polynomial time, and closed under bisimulation equivalence. It is shown that the class of these bisimulation-invariant Ptime queries has a natural logical characterization. It is captured by the straightforward extension of propositional-calculus to...
متن کاملAn application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras
We use the category of presheaves over PTIME-functions in order to show that Cook and Urquhart's higher-order function algebra PV ! deenes exactly the PTIME-functions. As a byproduct we obtain a syntax-free generalisation of PTIME-computability to higher types. By restricting to sheaves for a suitable topology we obtain a model for intuitionistic predicate logic with b 1-induction over PV ! and...
متن کاملOn the Computational Complexity of Cut-Elimination in Linear Logic
Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same normal form. This decision problem has been shown to be ptime-complete for Multiplicative Linear Logic (Mairson 2003). The latter result depends upon a restricted simulation of weakening and contraction for boolean values in MLL; ...
متن کامل